Definiteness, Animacy, and NP Ordering

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

NP Animacy Identification for Anaphora Resolution

In anaphora resolution for English, animacy identification can play an integral role in the application of agreement restrictions between pronouns and candidates, and as a result, can improve the accuracy of anaphora resolution systems. In this paper, two methods for animacy identification are proposed and evaluated using intrinsic and extrinsic measures. The first method is a rule-based one wh...

متن کامل

Cyclic Ordering is NP-Complete

The cyclic ordering problem is to recognize whether a collection of cyclically ordered triples of elements of a set T is derived from an arrangement of all the elements of T on a circle. This problem is shown to be NP-complete. A cyclic ordering of a set T = {l,. ., t ) is essentially an arrangement of the elements of T on a circle. A specific definition is as follows (see [4]). Two linear orde...

متن کامل

Where to place inaccessible subjects in Dutch: The role of definiteness and animacy

Cross-linguistically, both subjects and topical information tend to be placed at the beginning of a sentence. Subjects are generally highly topical, causing both tendencies to converge on the same word order. However, subjects that lack prototypical topic properties may give rise to an incongruence between the preference to start a sentence with the subject and the preference to start a sentenc...

متن کامل

On the NP Structure and Prenominal Ordering in Korean ∗

The flexibility of Korean NP structures has been well-observed, but there have been few attempts to provide precise syntactic structures. This paper at first reviews the basic distributional properties of Korean prenominal expressions as well as constraints in ordering, and then sketches a constraint-based, lexicalist analysis for Korean NP structures. Arguing for surface-based syntactic struct...

متن کامل

Solution of the Linear Ordering Problem (NP=P)

j=1 cijxij s. t. 0 6 xij 6 1, xij + xji = 1, 0 6 xij + xjk − xik 6 1, i 6= j, i 6= k, j 6= k, i, j, k = 1, ..., n. We denote the corresponding polytope by Bn. The polytope Bn has integer vertices corresponding to feasible solutions of the linear ordering problem as well as non-integer vertices. We denote the polytope of integer vertices as Pn. Let us give an example of non-integer vertex in Bn ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annual Meeting of the Berkeley Linguistics Society

سال: 1977

ISSN: 2377-1666,0363-2946

DOI: 10.3765/bls.v3i0.2243